The equality problem for infinite words generated by primitive morphisms
نویسنده
چکیده
We study the equality problem for infinite words obtained by iterating morphisms. In particular, we give a practical algorithm to decide whether or not two words generated by primitive morphisms are equal.
منابع مشابه
Binary Equality Words for Periodic Morphisms
Let g and h be binary morphisms defined on {a, b}∗, and let g be periodic and h nonperiodic. It is well known that their equality language is generated by at most one nonempty word. Suppose |h(b)| ≥ |h(a)|. We show that then the equality word is equal to aba , with i, j ≥ 0. Binary equality sets are the simplest nontrivial equality languages. Nevertheless, their full description is still not kn...
متن کاملOn stabilizers of infinite words
The stabilizer of an infinite word w over a finite alphabet Σ is the monoid of morphisms over Σ that fix w. In this paper we study various problems related to stabilizers and their generators. We show that over a binary alphabet, there exist stabilizers with at least n generators for all n. Over a ternary alphabet, the monoid of morphisms generating a given infinite word by iteration can be inf...
متن کاملA Unique Structure of Two-Generated Binary Equality Sets
Let L be the equality set of two distinct injective morphisms g and h, and let L be generated by at least two words. Recently it was proved ([2]) that such an L is generated by two words and g and h can be chosen marked from both sides. We use this result to show that L is of the form {ab, ba}, with i ≥ 1.
متن کاملOn Morphisms Preserving Primitive Words
A word is called primitive if it cannot be expressed as the power of another word. Morphisms preserving primitive words are investigated. Similarly to the word case, each square-free morphism is a primitive morphism but the converse does not hold. A precise characterization of primitive morphisms is provided in terms of pure codes. An easily testable characterization is given for uniform morphi...
متن کاملPermutation complexity of the fixed points of some uniform binary morphisms
The notion of an infinite permutation was introduced in [1], where were investigated the periodic properties and low complexity of permutations. Similarly to the definition of subword complexity of infinite words, we can introduce the notion of the factor complexity of a permutation as the number of distinct subpermutations of a given length. The notion of a permutation generated by an infinite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 207 شماره
صفحات -
تاریخ انتشار 2009